836 - Largest submatrix (DP, programación dinámica, O(n^4) ¿Existirá un O(n^3)?)
[andmenj-acm.git] / 11172 - Relational operator / 11172.cpp
blobdfc9e379c8af20c62048bd33dd785bd4c7e9c46f
1 #include <cstdlib>
2 #include <iostream>
4 using namespace std;
6 int main(int argc, char *argv[])
8 int t;
9 cin >> t;
10 long a, b;
11 for (int i=0; i<t; i++){
12 cin >> a >> b;
13 if (a<b) cout << "<\n";
14 else if (a>b) cout << ">\n";
15 else cout << "=\n";
17 return 0;